Locally twisted cubes are 4-pancyclic
نویسندگان
چکیده
منابع مشابه
Panconnectivity of locally twisted cubes
The locally twisted cube LTQn which is a newly introduced interconnection network for parallel computing is a variant of the hypercube Qn . Yang et al. [X. Yang, G.M. Megson, D.J. Evans, Locally twisted cubes are 4-pancyclic, Applied Mathematics Letters 17 (2004) 919–925] proved that LTQn is Hamiltonian connected and contains a cycle of length from 4 to 2 n for n ≥ 3. In this work, we improve t...
متن کاملConnectivity of Locally Exchanged Twisted Cubes∗
Connectivity κ(G) of a graph G is the minimum number of vertices whose removal leaves the remaining graph disconnected or trivial. This parameter is important for interconnection networks and can be used to measure reliability in such networks. In this paper, a new interconnection network called locally exchanged twisted cube (LETQ for short), denoted LeTQ(s, t), is proposed. We obtain some bas...
متن کاملWeakly Edge-Pancyclicity of Locally Twisted Cubes
The locally twisted cube LTQn is a newly introduced interconnection network for parallel computing. As a variant of the hypercube Qn, LTQn has better properties than Qn with the same number of links and processors. Yang, Megson and Evans [Locally twisted cubes are 4pancyclic, Applied Mathematics Letters, 17 (2004), 919-925] showed that LTQn contains a cycle of every length from 4 to 2 . In this...
متن کاملLocally Pancyclic Graphs
We prove the following theorem. Let G be a graph of order n and let W V(G). If |W | 3 and dG(x)+dG( y) n for every pair of non-adjacent vertices x, y # W, then either G contains cycles C , C, ..., C |W | such that C i contains exactly i vertices from W (i=3, 4, ..., |W | ), or |W |=n and G=Kn 2, n 2 , or else |W |=4, G[W]=K2, 2 . This generalizes a result of J. A. Bondy (1971, J. Combin. Theory...
متن کاملConstruction independent spanning trees on locally twisted cubes in parallel
Let LTQn denote the n-dimensional locally twisted cube. Hsieh and Tu (2009) [13] presented an algorithm to construct n edge-disjoint spanning trees rooted at vertex 0 in LTQn. Later on, Lin et al. (2010) [23] proved that Hsieh and Tu’s spanning trees are indeed independent spanning trees (ISTs for short), i.e., all spanning trees are rooted at the same vertex r and for any other vertex v(6= r),...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Applied Mathematics Letters
سال: 2004
ISSN: 0893-9659
DOI: 10.1016/j.aml.2003.10.009